/*
 * @Author: szx
 * @Date: 2021-10-30 12:48:02
 * @LastEditTime: 2021-10-30 12:49:35
 * @Description:
 * @FilePath: \leetcode\100-199\118\118.cpp
 */
#include <iostream>
#include <vector>
using namespace std;
class Solution {
   public:
    vector<vector<int>> generate(int numRows) {
        vector<vector<int>> res(numRows, vector<int>());
        for (int i = 0; i < numRows; i++) {
            // 重塑res[i]的大小
            res[i].resize(i + 1, 1);
            for (int j = 1; j < i; j++) {
                res[i][j] = res[i - 1][j - 1] + res[i - 1][j];
            }
        }
        return res;
    }
};

int main() { return 0; }